منابع مشابه
DE-LEACH: Distance and Energy Aware LEACH
Wireless sensor network consists of large number of tiny sensor nodes which are usually deployed in a harsh environment. Self configuration and infrastructure less are the two fundamental properties of sensor networks. Sensor nodes are highly energy constrained devices because they are battery operated devices and due to harsh environment deployment it is impossible to change or recharge their ...
متن کاملImprovement on LEACH: Seeded LEACH-KED
This paper summarizes the work used to improve low energy adaptive cluster hierarchy (LEACH) algorithm and proposes a new protocol “Seeded LEACH-KED” in order to increase the network lifetime and then compare its result with the LEACH , LEACH-C and LEACH-KED. Prolonging network lifetime is the way to provide energy efficient WSNs. This research is inspired by the fact that LEACH occupies a very...
متن کاملEnergy Balancing LEACH for Wireless Sensor Networks
Abstract This paper suggests an algorithm which increases the energy efficiency based on LEACH (Low Energy Adaptive Clustering Hierarchy)[1] for sensor network routing. Due to the random cluster head election process, LEACH does not guarantee the optimization for the number and position of cluster heads. Also it results in inefficiency in energy consumption. This paper suggests improved cluster...
متن کاملHybrid TB-LEACH Energy Based Multihop Protocol
Wireless sensor network is defined as the network composed of tiny and energy restricted sensor nodes. Sensor nodes collect the useful information from surrounding environment and deliver it to the base station. Sensor nodes have limited energy. Routing protocols must consume minimum energy in order to prolong the network lifetime. Clustering is most energy efficient technique. LEACH is one of ...
متن کاملEnergy Efficient A-Leach Routing Protocol
Leach was the first most Routing Protocol used clustering concept in wireless sensor networks. Leach algorithmre-clustering process play vital role to gather data in cycles known as round. During each round a specific percentage of total nodes are elected as cluster heads (CHs). Each node get chance to become CH according to their probability in particular round. It is possible that not a singl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15384-4072